-
1 spanning subgraph
основной подграф
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > spanning subgraph
-
2 spanning subgraph
Большой англо-русский и русско-английский словарь > spanning subgraph
-
3 spanning subgraph
1) Математика: остовный подграф2) Вычислительная техника: основной подграф -
4 spanning subgraph
-
5 spanning subgraph
The New English-Russian Dictionary of Radio-electronics > spanning subgraph
-
6 spanning subgraph
т. граф. -
7 spanning subgraph
-
8 spanning subgraph
English-Russian dictionary of electronics > spanning subgraph
-
9 subgraph
-
10 subgraph
-
11 subgraph
- complete subgraph
- degenerate subgraph
- dissimilar subgraphs
- generated subgraph
- geodesic subgraph
- induced subgraph
- multiplicative subgraph
- phonemic subgraph
- plane subgraph
- spanning subgraphThe New English-Russian Dictionary of Radio-electronics > subgraph
-
12 spanning
стягивающий, натянутый minimal spanning tree ≈ минимальное связывающее дерево shortest spanning tree ≈ кратчайший остов - spanning arborescence - spanning arc - spanning forest - spanning hypertree - spanning set - spanning simplex - spanning subgraph - spanning subnetwork - spanning subtree - spanning tree - spanning walk ОхватБольшой англо-русский и русско-английский словарь > spanning
-
13 spanning tree
алгоритм, позволяющий установить множество параллельных независимых маршрутов (redundant pathway) между несколькими локальными сетями или сегментами таких сетей. Применяется в соединительных (связующих) устройствахдерево U называется остовным деревом графа G, если оно является подграфом графа G, а все вершины U и G совпадаютАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > spanning tree
-
14 остовный подграф
Большой англо-русский и русско-английский словарь > остовный подграф
См. также в других словарях:
Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… … Wikipedia
Minimum degree spanning tree — In graph theory, for a connected graph G, a spanning tree T is a subgraph of G with the least number of edges that still spans G. A number of properties can be proved about T. T is acyclic, has ( | V | − 1) edges where V is the number of vertices … Wikipedia
K-minimum spanning tree — In mathematics, the K minimum spanning tree is a graph G that spans some K of N vertices in the input set S with the minimum total length. K is less than or equal to N. The K MST does not have to be a subgraph of the minimum spanning tree (MST).… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Forbidden graph characterization — A forbidden graph characterization is a method of specifying or describing a family of graphs whereby a graph belongs to the family in question if and only if for the graph in question certain graphs, called forbidden graphs, are not its parts of … Wikipedia
Tutte theorem — In the mathematical discipline of graph theory the Tutte theorem, named after William Thomas Tutte, is a characterization of graphs with perfect matchings. It is a generalization of the marriage theorem and is a special case of the Tutte Berge… … Wikipedia
Geometric spanner — A geometric spanner or a k spanner graph or a k spanner was initially introduced as a weighted graph over a set of points as its vertices which for every pair of vertices has a path between them of weight at most k times the spatial distance… … Wikipedia